A fractal set from the binary reflected Gray code
نویسنده
چکیده
The permutation associated with the decimal expression of the binary reflected Gray code with N bits is considered. Its cycle structure is studied. Considered as a set of points, its self-similarity is pointed out. As a fractal, it is shown to be the attractor of a IFS. For large values of N the set is examined from the point of view of time series analysis. PACS numbers: 05.45 Df, 05.45 Tp AMS classification scheme numbers: 28A80, 37M10 § To whom correspondence should be addressed A fractal set from the binary reflected Gray code 2
منابع مشابه
On binary reflected Gray codes and functions
The Binary Reflected Gray Code function b is defined as follows: If m is a nonnegative integer, then b(m) is the integer obtained when initial zeros are omitted from the binary reflected Gray code of length m. This paper examines this Gray code function and its inverse and gives simple algorithms to generate both. It also simplifies Conder’s result that the jth letter of the kth word of the bin...
متن کاملA Dynamic Programming Approach to Generating a Binary Reflected Gray Code Sequence
A binary reflected Gray code (Gray code for short) is a one-to-one function G(i) of the integers 0 • i • 2 – 1 (for some pre-selected value of n) to binary numbers such that the binary number for G(i) and G(i+1) differ in exactly one bit. For example, with N = 3, the Gray codes (written in binary) are 000, 001, 011, 010, 110, 111, 101, 100. In this paper, we describe a dynamic programming algor...
متن کاملRestricted compositions and permutations: From old to new Gray codes
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of ≺ to the set of compositions and bounded compositio...
متن کاملA note on Beckett-Gray codes and the relationship of Gray codes to data structures
In this paper we introduce a natural mathematical structure derived from Samuel Beckett’s play “Quad”. We call this structure a binary Beckett-Gray code. We enumerate all codes for n ≤ 6 and give examples for n = 7, 8. Beckett-Gray codes can be realized as successive states of a queue data structure. We show that the binary reflected Gray code can be realized as successive states of two stack d...
متن کاملIndex notation of grid graphs
By defining grids as graphs, geometric graphs can be represented in a very concise way. 0 Introduction In studying fractals like Hilbert curve, Koch snow flake, Sierpinsi triangle and many others [1], the need arose for a universal and compact notation. This paper gives a description. For that a new set of graphs are defined of which the fractals mentioned before are examples. The index notatio...
متن کامل